Quadratic third-order tensor optimization problem with quadratic constraints
نویسندگان
چکیده
منابع مشابه
Quadratic third-order tensor optimization problem with quadratic constraints
Quadratically constrained quadratic programs (QQPs) problems play an important modeling role in many diverse problems. These problems are in general NP hard and numerically intractable. Semidefinite programming (SDP) relaxations often provide good approximate solutions to these hard problems. For several special cases of QQP, e.g., convex programs and trust region subproblems, SDP relaxation pr...
متن کاملStrong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
We consider the problem of minimizing an indefinite quadratic function subject to two quadratic inequality constraints. When the problem is defined over the complex plane we show that strong duality holds and obtain necessary and sufficient optimality conditions. We then develop a connection between the image of the real and complex spaces under a quadratic mapping, which together with the resu...
متن کاملApproximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
We consider the NP-hard problem of finding a minimum norm vector in n-dimensional real or complex Euclidean space, subject to m concave homogeneous quadratic constraints. We show that a semidefinite programming (SDP) relaxation for this nonconvex quadratically constrained quadratic program (QP) provides an O(m) approximation in the real case, and an O(m) approximation in the complex case. Moreo...
متن کاملApproximating Global Quadratic Optimization with Convex Quadratic Constraints
We consider the problem of approximating the global maximum of a quadratic program (QP) subject to convex non-homogeneous quadratic constraints. We prove an approximation quality bound that is related to a condition number of the convex feasible set; and it is the currently best for approximating certain problems, such as quadratic optimization over the assignment polytope, according to the bes...
متن کاملLinear Quadratic Gaussian Problem with Constraints
In this paper, an aggregate production-planning problem is formulated as a stochastic linear quadratic problem with chance constraints on state and control variables. The stochastic model proposed extends the classical aggregate model developed by Holt, Modigliani, Muth and Simon (HMMS). As an example of application, an equivalent deterministic problem is developed from the stochastic model. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics, Optimization & Information Computing
سال: 2014
ISSN: 2310-5070,2311-004X
DOI: 10.19139/67